Approximation Schemes for Low-rank Binary Matrix Approximation Problems
نویسندگان
چکیده
منابع مشابه
Parameterized Low-Rank Binary Matrix Approximation
We provide a number of algorithmic results for the following family of problems: For a given binary m × n matrix A and integer k, decide whether there is a “simple” binary matrix B which differs from A in at most k entries. For an integer r, the “simplicity” of B is characterized as follows. • Binary r-Means: Matrix B has at most r different columns. This problem is known to be NP-complete alre...
متن کاملApproximation Schemes for Binary Quadratic Programming Problems with Low cp-Rank Decompositions
Binary quadratic programming problems have attracted much attention in the last few decades due to their potential applications. This type of problems are NP-hard in general, and still considered a challenge in the design of efficient approximation algorithms for their solutions. The purpose of this paper is to investigate the approximability for a class of such problems where the constraint ma...
متن کاملStochastic algorithms for solving structured low-rank matrix approximation problems
In this paper, we investigate the complexity of the numerical construction of the Hankel structured low-rank approximation (HSLRA) problem, and develop a family of algorithms to solve this problem. Briefly, HSLRA is the problem of finding the closest (in some pre-defined norm) rank r approximation of a given Hankel matrix, which is also of Hankel structure. We demonstrate that finding optimal s...
متن کاملLocal Low-Rank Matrix Approximation
Matrix approximation is a common tool in recommendation systems, text mining, and computer vision. A prevalent assumption in constructing matrix approximations is that the partially observed matrix is of low-rank. We propose a new matrix approximation model where we assume instead that the matrix is locally of low-rank, leading to a representation of the observed matrix as a weighted sum of low...
متن کاملSchur method for low-rank matrix approximation
The usual way to compute a low-rank approximant of a matrix H is to take its truncated SVD. However, the SVD is computationally expensive. This paper describes a much simpler generalized Schur-type algorithm to compute similar low-rank approximants. For a given matrix H which has d singular values larger than ε, we find all rank d approximants Ĥ such that H − Ĥ has 2-norm less than ε. The set o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2020
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3365653